Symbolic computation of the Moore-Penrose inverse using a partitioning method

نویسندگان

  • Marko D. Petkovic
  • Predrag S. Stanimirovic
چکیده

We propose an extension of the Grevile’s partitioning method for computing the Moore-Penrose inverse of two-variable rational and polynomial complex matrices. Also we developed corresponding effective algorithm, applicable in the case when there are only few degrees in A(s1, s2) corresponding to nonzero coefficient matrices. These algorithms are implemented using symbolic and functional possibilities of the package MATHEMATICA. AMS Subj. Class.: 15A09, 68Q40.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic computation of weighted Moore-Penrose inverse using partitioning method

We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Continuing this idea, we develop an algorithm for computing the weighted Moore-Penrose inverse of one-variable polynomial matrix. These methods and algorithms are generalizations of the method or computing the weighted Moore-Penrose inverse for constant matrices, originated in [2...

متن کامل

An Efficient Schulz-type Method to Compute the Moore-Penrose Inverse

A new Schulz-type method to compute the Moore-Penrose inverse of a matrix is proposed. Every iteration of the method involves four matrix multiplications. It is proved that this method converge with fourth-order. A wide set of numerical comparisons shows that the average number of matrix multiplications and the average CPU time of our method are considerably less than those of other methods.

متن کامل

Effective partitioning method for computing weighted Moore-Penrose inverse

We introduce a method and algorithm for computing the weighted MoorePenrose inverse of multiple-variable polynomial matrix and the related algorithm which is appropriated for sparse polynomial matrices. These methods and algorithms are generalizations of algorithms developed in [24] to multiple variable rational and polynomial matrices and improvements of these algorithms on sparse matrices. Al...

متن کامل

Computation of generalized inverses using PHP/MySQL environment

The main aim of this paper is to develop a client/server based model for computing the weighted Moore-Penrose inverse using the partitioning method as well as for storage of generated results. The web application is developed in the PHP/MySQL environment. The source code is open and free for testing by using a Web browser. Influence of different matrix representations and storage systems on the...

متن کامل

An accelerated iterative method for computing weighted Moore-Penrose inverse

The goal of this paper is to present an accelerated iterative method for computing weighted Moore–Penrose inverse. Analysis of convergence is included to show that the proposed scheme has sixth-order convergence. Using a proper initial matrix, a sequence of iterates will be produced, which is convergent to the weighted Moore–Penrose inverse. Numerical experiments are reported to show the effici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 82  شماره 

صفحات  -

تاریخ انتشار 2005